Site percolation and random walks on d-dimensional Kagomé lattices
نویسنده
چکیده
The site percolation problem is studied on d-dimensional generalizations of the Kagomé lattice. These lattices are isotropic and have the same coordination number q as the hyper-cubic lattices in d dimensions, namely q = 2d . The site percolation thresholds are calculated numerically for d = 3, 4, 5, and 6. The scaling of these thresholds as a function of dimension d, or alternatively q, is different than for hypercubic lattices: pc ∼ 2/q instead of pc ∼ 1/(q − 1). The latter is the Bethe approximation, which is usually assumed to hold for all lattices in high dimensions. A series expansion is calculated, in order to understand the different behaviour of the Kagomé lattice. The return probability of a random walker on these lattices is also shown to scale as 2/q. For bond percolation on d-dimensional diamond lattices these results imply pc ∼ 1/(q − 1).
منابع مشابه
Single Random Walker on Disordered Lattices
Random walks on square lattice percolating clusters were followed for up to 2 • 10 ~ steps. The mean number of distinct sites visited (SN) gives a spectral dimension of d s = 1.30 5:0.03 consistent with superuniversality (d S = 4/3) but closer to the alternative d s = 182/139, based on the low dimensionality correction. Simulations are also given for walkers on an energetically disordered latti...
متن کاملWalking on fractals: diffusion and self-avoiding walks on percolation clusters
We consider random walks (RWs) and self-avoiding walks (SAWs) on disordered lattices directly at the percolation threshold. Applying numerical simulations, we study the scaling behavior of the models on the incipient percolation cluster in space dimensions d = 2, 3, 4. Our analysis yields estimates of universal exponents, governing the scaling laws for configurational properties of RWs and SAWs...
متن کاملFractal to Euclidean crossover and scaling for random walks on percolation
We perform random walk simulations on binary three-dimensional simple cubic lattices covering the entire ratio of open/closed sites (fractionp) from the critical percolation threshold to the perfect crystal. We observe fractal behavior at the critical point and derive the value of the number-of-sites-visited exponent, in excellent agreement with previous work or conjectures, but with a new and ...
متن کامل"Generalized des Cloizeaux" exponent for self-avoiding walks on the incipient percolation cluster.
We study the asymptotic shape of self-avoiding random walks (SAW) on the backbone of the incipient percolation cluster in d-dimensional lattices analytically. It is generally accepted that the configurational averaged probability distribution function for the end-to-end distance r of an N step SAW behaves as a power law for r-->0. In this work, we determine the corresponding exponen...
متن کاملEffect of dimensionality on the percolation thresholds of various d-dimensional lattices
We show analytically that the [0,1], [1,1], and [2,1] Padé approximants of the mean cluster number S(p) for site and bond percolation on general d-dimensional lattices are upper bounds on this quantity in any Euclidean dimension d , where p is the occupation probability. These results lead to certain lower bounds on the percolation threshold pc that become progressively tighter as d increases a...
متن کامل